Intersections of Random Walks, G.F. Lawler, Birkhäuser, 1991, 219 pp.
نویسندگان
چکیده
منابع مشابه
Two - sided random walks conditioned to have no intersections ∗
Let S, S be independent simple random walks in Z (d = 2, 3) started at the origin. We construct two-sided random walk paths conditioned that S[0,∞) ∩ S[1,∞) = ∅ by showing the existence of the following limit: lim n→∞ P (· | S[0, τ(n)] ∩ S[1, τ(n)] = ∅), where τ (n) = inf{k ≥ 0 : |S(k)| ≥ n}. Moreover, we give upper bounds of the rate of the convergence. These are discrete analogues of results ...
متن کاملA PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملLaws of the Iterated Logarithm for Triple Intersections of Three Dimensional Random Walks
Let X = {Xn, n ≥ 1}, X ′ = {X ′ n, n ≥ 1} and X ′′ = {X ′′ n, n ≥ 1} be three independent copies of a symmetric random walk in Z3 with E(|X1| log+ |X1|) < ∞. In this paper we study the asymptotics of In, the number of triple intersections up to step n of the paths of X , X ′ and X ′′ as n→∞. Our main result is lim sup n→∞ In log(n) log3(n) = 1 π|Q| a.s. where Q denotes the covariance matrix of ...
متن کاملIntersections of Random Lines
We have three overlapping planar sets within a bounded window. These sets do not have to be convex, or even connected domains. We find a simple expression for the probability that random straight lines across two of the sets intersect within the third. The lines are taken uniformly at random from beams of parallel lines, with the orientations of the beams from an arbitrary joint distribution. T...
متن کاملRandom Walks on Random Graphs
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs. Given a graphG = (V,E), let dG(v) denote the degree of vertex v for all...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1993
ISSN: 0001-8708
DOI: 10.1006/aima.1993.1048